Spectral properties of complex networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical and spectral properties of complex networks

Dynamical properties of complex networks are related to the spectral properties of the Laplacian matrix that describes the pattern of connectivity of the network. In particular we compute the synchronization time for different types of networks and different dynamics. We show that the main dependence of the synchronization time is on the smallest nonzero eigenvalue of the Laplacian matrix, in c...

متن کامل

Spectral Properties of Cubic Complex Pisot Units

For q ∈ R, q > 1, Erdős, Joó and Komornik study distances of the consecutive points in the set

متن کامل

Spectral Measure of Robustness in Complex Networks

Jun Wu, 2, 3, ∗ Yue-Jin Tan, Hong-Zhong Deng, Yong Li, Bin Liu, and Xin Lv College of Information Systems and Management, National University of Defense Technology, Changsha 410073, P. R. China. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, P. R. China Institute for Mathematical Sciences, Imperial College London, London SW7 2PG, United Kingdom (Dated: February ...

متن کامل

Spectral measures of bipartivity in complex networks.

We introduce a quantitative measure of network bipartivity as a proportion of even to total number of closed walks in the network. Spectral graph theory is used to quantify how close to bipartite a network is and the extent to which individual nodes and edges contribute to the global network bipartivity. It is shown that the bipartivity characterizes the network structure and can be related to ...

متن کامل

Spectral coarse graining of complex networks.

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining scheme for complex networks. By construction the coarse graining preserves the slow modes of the walk, while reducing significantly the size...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science

سال: 2018

ISSN: 1054-1500,1089-7682

DOI: 10.1063/1.5040897